TSTP Solution File: ITP189^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP189^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 22:16:44 EDT 2024
% Result : Theorem 2.08s 0.73s
% Output : CNFRefutation 2.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 18
% Syntax : Number of formulae : 27 ( 9 unt; 14 typ; 0 def)
% Number of atoms : 20 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 139 ( 8 ~; 5 |; 0 &; 124 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 13 ( 0 ^ 13 !; 0 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
pi: $tType ).
thf(decl_sort2,type,
name: $tType ).
thf(decl_sort3,type,
late_freeRes: $tType ).
thf(decl_sort4,type,
late_residual: $tType ).
thf(decl_24,type,
par: pi > pi > pi ).
thf(decl_26,type,
res: name > pi > pi ).
thf(decl_34,type,
late_FreeR: late_freeRes > pi > late_residual ).
thf(decl_37,type,
late_transitions: pi > late_residual > $o ).
thf(decl_48,type,
fresh_1641682979reeRes: name > late_freeRes > $o ).
thf(decl_101,type,
p: pi ).
thf(decl_102,type,
p2: pi ).
thf(decl_104,type,
q: pi ).
thf(decl_106,type,
alpha: late_freeRes ).
thf(decl_107,type,
x: name ).
thf(conj_0,conjecture,
late_transitions @ ( res @ x @ ( par @ p @ q ) ) @ ( late_FreeR @ alpha @ ( res @ x @ ( par @ p2 @ q ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(fact_11_ResF,axiom,
! [X1: pi,X2: late_freeRes,X3: pi,X17: name] :
( ( late_transitions @ X1 @ ( late_FreeR @ X2 @ X3 ) )
=> ( ( fresh_1641682979reeRes @ X17 @ X2 )
=> ( late_transitions @ ( res @ X17 @ X1 ) @ ( late_FreeR @ X2 @ ( res @ X17 @ X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_11_ResF) ).
thf(fact_1__092_060open_062P_A_092_060parallel_062_AQ_A_092_060longmapsto_062_A_092_060alpha_062_A_092_060prec_062_AP_H_A_092_060parallel_062_AQ_092_060close_062,axiom,
late_transitions @ ( par @ p @ q ) @ ( late_FreeR @ alpha @ ( par @ p2 @ q ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1__092_060open_062P_A_092_060parallel_062_AQ_A_092_060longmapsto_062_A_092_060alpha_062_A_092_060prec_062_AP_H_A_092_060parallel_062_AQ_092_060close_062) ).
thf(fact_0__092_060open_062x_A_092_060sharp_062_A_092_060alpha_062_092_060close_062,axiom,
fresh_1641682979reeRes @ x @ alpha,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0__092_060open_062x_A_092_060sharp_062_A_092_060alpha_062_092_060close_062) ).
thf(c_0_4,negated_conjecture,
~ ( late_transitions @ ( res @ x @ ( par @ p @ q ) ) @ ( late_FreeR @ alpha @ ( res @ x @ ( par @ p2 @ q ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_5,plain,
! [X1561: pi,X1562: late_freeRes,X1563: pi,X1564: name] :
( ~ ( late_transitions @ X1561 @ ( late_FreeR @ X1562 @ X1563 ) )
| ~ ( fresh_1641682979reeRes @ X1564 @ X1562 )
| ( late_transitions @ ( res @ X1564 @ X1561 ) @ ( late_FreeR @ X1562 @ ( res @ X1564 @ X1563 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_11_ResF])])]) ).
thf(c_0_6,negated_conjecture,
~ ( late_transitions @ ( res @ x @ ( par @ p @ q ) ) @ ( late_FreeR @ alpha @ ( res @ x @ ( par @ p2 @ q ) ) ) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
thf(c_0_7,plain,
! [X3: pi,X1: pi,X8: name,X2: late_freeRes] :
( ( late_transitions @ ( res @ X8 @ X1 ) @ ( late_FreeR @ X2 @ ( res @ X8 @ X3 ) ) )
| ~ ( late_transitions @ X1 @ ( late_FreeR @ X2 @ X3 ) )
| ~ ( fresh_1641682979reeRes @ X8 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
late_transitions @ ( par @ p @ q ) @ ( late_FreeR @ alpha @ ( par @ p2 @ q ) ),
inference(split_conjunct,[status(thm)],[fact_1__092_060open_062P_A_092_060parallel_062_AQ_A_092_060longmapsto_062_A_092_060alpha_062_A_092_060prec_062_AP_H_A_092_060parallel_062_AQ_092_060close_062]) ).
thf(c_0_9,negated_conjecture,
~ ( late_transitions @ ( res @ x @ ( par @ p @ q ) ) @ ( late_FreeR @ alpha @ ( res @ x @ ( par @ p2 @ q ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X8: name] :
( ( late_transitions @ ( res @ X8 @ ( par @ p @ q ) ) @ ( late_FreeR @ alpha @ ( res @ X8 @ ( par @ p2 @ q ) ) ) )
| ~ ( fresh_1641682979reeRes @ X8 @ alpha ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,plain,
fresh_1641682979reeRes @ x @ alpha,
inference(split_conjunct,[status(thm)],[fact_0__092_060open_062x_A_092_060sharp_062_A_092_060alpha_062_092_060close_062]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ITP189^1 : TPTP v8.2.0. Released v7.5.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat May 18 17:42:23 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.08/0.73 # Version: 3.1.0-ho
% 2.08/0.73 # Preprocessing class: HSLSSMSMSSSNSFA.
% 2.08/0.73 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 2.08/0.73 # Starting new_ho_10 with 900s (3) cores
% 2.08/0.73 # Starting sh2lt with 300s (1) cores
% 2.08/0.73 # Starting new_ho_5 with 300s (1) cores
% 2.08/0.73 # Starting full_lambda_5 with 300s (1) cores
% 2.08/0.73 # Starting sh9 with 300s (1) cores
% 2.08/0.73 # Starting ehoh_best8_lambda with 300s (1) cores
% 2.08/0.73 # sh2lt with pid 28223 completed with status 0
% 2.08/0.73 # Result found by sh2lt
% 2.08/0.73 # Preprocessing class: HSLSSMSMSSSNSFA.
% 2.08/0.73 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 2.08/0.73 # Starting new_ho_10 with 900s (3) cores
% 2.08/0.73 # Starting sh2lt with 300s (1) cores
% 2.08/0.73 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 2.08/0.73 # Search class: HGHSM-FSLM32-MSFFFFBN
% 2.08/0.73 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.08/0.73 # Starting sh6 with 181s (1) cores
% 2.08/0.73 # sh6 with pid 28228 completed with status 0
% 2.08/0.73 # Result found by sh6
% 2.08/0.73 # Preprocessing class: HSLSSMSMSSSNSFA.
% 2.08/0.73 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 2.08/0.73 # Starting new_ho_10 with 900s (3) cores
% 2.08/0.73 # Starting sh2lt with 300s (1) cores
% 2.08/0.73 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 2.08/0.73 # Search class: HGHSM-FSLM32-MSFFFFBN
% 2.08/0.73 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.08/0.73 # Starting sh6 with 181s (1) cores
% 2.08/0.73 # Preprocessing time : 0.017 s
% 2.08/0.73 # Presaturation interreduction done
% 2.08/0.73
% 2.08/0.73 # Proof found!
% 2.08/0.73 # SZS status Theorem
% 2.08/0.73 # SZS output start CNFRefutation
% See solution above
% 2.08/0.73 # Parsed axioms : 434
% 2.08/0.73 # Removed by relevancy pruning/SinE : 198
% 2.08/0.73 # Initial clauses : 763
% 2.08/0.73 # Removed in clause preprocessing : 16
% 2.08/0.73 # Initial clauses in saturation : 747
% 2.08/0.73 # Processed clauses : 1487
% 2.08/0.73 # ...of these trivial : 13
% 2.08/0.73 # ...subsumed : 317
% 2.08/0.73 # ...remaining for further processing : 1157
% 2.08/0.73 # Other redundant clauses eliminated : 51
% 2.08/0.73 # Clauses deleted for lack of memory : 0
% 2.08/0.73 # Backward-subsumed : 13
% 2.08/0.73 # Backward-rewritten : 14
% 2.08/0.73 # Generated clauses : 1652
% 2.08/0.73 # ...of the previous two non-redundant : 1485
% 2.08/0.73 # ...aggressively subsumed : 0
% 2.08/0.73 # Contextual simplify-reflections : 0
% 2.08/0.73 # Paramodulations : 1569
% 2.08/0.73 # Factorizations : 2
% 2.08/0.73 # NegExts : 2
% 2.08/0.73 # Equation resolutions : 73
% 2.08/0.73 # Disequality decompositions : 0
% 2.08/0.73 # Total rewrite steps : 177
% 2.08/0.73 # ...of those cached : 112
% 2.08/0.73 # Propositional unsat checks : 0
% 2.08/0.73 # Propositional check models : 0
% 2.08/0.73 # Propositional check unsatisfiable : 0
% 2.08/0.73 # Propositional clauses : 0
% 2.08/0.73 # Propositional clauses after purity: 0
% 2.08/0.73 # Propositional unsat core size : 0
% 2.08/0.73 # Propositional preprocessing time : 0.000
% 2.08/0.73 # Propositional encoding time : 0.000
% 2.08/0.73 # Propositional solver time : 0.000
% 2.08/0.73 # Success case prop preproc time : 0.000
% 2.08/0.73 # Success case prop encoding time : 0.000
% 2.08/0.73 # Success case prop solver time : 0.000
% 2.08/0.73 # Current number of processed clauses : 413
% 2.08/0.73 # Positive orientable unit clauses : 117
% 2.08/0.73 # Positive unorientable unit clauses: 1
% 2.08/0.73 # Negative unit clauses : 96
% 2.08/0.73 # Non-unit-clauses : 199
% 2.08/0.73 # Current number of unprocessed clauses: 1328
% 2.08/0.73 # ...number of literals in the above : 3908
% 2.08/0.73 # Current number of archived formulas : 0
% 2.08/0.73 # Current number of archived clauses : 721
% 2.08/0.73 # Clause-clause subsumption calls (NU) : 168526
% 2.08/0.73 # Rec. Clause-clause subsumption calls : 45254
% 2.08/0.73 # Non-unit clause-clause subsumptions : 94
% 2.08/0.73 # Unit Clause-clause subsumption calls : 1806
% 2.08/0.73 # Rewrite failures with RHS unbound : 0
% 2.08/0.73 # BW rewrite match attempts : 308
% 2.08/0.73 # BW rewrite match successes : 8
% 2.08/0.73 # Condensation attempts : 0
% 2.08/0.73 # Condensation successes : 0
% 2.08/0.73 # Termbank termtop insertions : 89968
% 2.08/0.73 # Search garbage collected termcells : 15496
% 2.08/0.73
% 2.08/0.73 # -------------------------------------------------
% 2.08/0.73 # User time : 0.212 s
% 2.08/0.73 # System time : 0.015 s
% 2.08/0.73 # Total time : 0.227 s
% 2.08/0.73 # Maximum resident set size: 5264 pages
% 2.08/0.73
% 2.08/0.73 # -------------------------------------------------
% 2.08/0.73 # User time : 0.225 s
% 2.08/0.73 # System time : 0.020 s
% 2.08/0.73 # Total time : 0.245 s
% 2.08/0.73 # Maximum resident set size: 2656 pages
% 2.08/0.73 % E---3.1 exiting
% 2.08/0.74 % E exiting
%------------------------------------------------------------------------------